1

Saving comparisons in the Crochemore-Perrin string-matching algorithm

Dany Breslauer
Journal:
Theoretical Computer Science
Year:
1996
Language:
english
File:
PDF, 1.01 MB
english, 1996
2

Rotations of Periodic Strings and Short Superstrings

Dany Breslauer, Tao Jiang, Zhigen Jiang
Journal:
Journal of Algorithms
Year:
1997
Language:
english
File:
PDF, 219 KB
english, 1997
3

On the Comparison Complexity of the String Prefix-Matching Problem

Dany Breslauer, Livio Colussi, Laura Toniolo
Journal:
Journal of Algorithms
Year:
1998
Language:
english
File:
PDF, 525 KB
english, 1998
4

Efficient Comparison Based String Matching

Dany Breslauer, Zvi Galil
Journal:
Journal of Complexity
Year:
1993
File:
PDF, 1.15 MB
1993
5

Tight comparison bounds for the string prefix-matching problem

Dany Breslauer, Livio Colussi, Laura Toniolo
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 621 KB
english, 1993
6

Testing string superprimitivity in parallel

Dany Breslauer
Journal:
Information Processing Letters
Year:
1994
Language:
english
File:
PDF, 642 KB
english, 1994
7

Fast parallel string prefix-matching

Dany Breslauer
Journal:
Theoretical Computer Science
Year:
1995
Language:
english
File:
PDF, 761 KB
english, 1995
9

The suffix tree of a tree and minimizing sequential transducers

Dany Breslauer
Journal:
Theoretical Computer Science
Year:
1998
Language:
english
File:
PDF, 1013 KB
english, 1998
10

On competitive on-line paging with lookahead

Dany Breslauer
Journal:
Theoretical Computer Science
Year:
1998
Language:
english
File:
PDF, 833 KB
english, 1998
11

An on-line string superprimitivity test

Dany Breslauer
Journal:
Information Processing Letters
Year:
1992
Language:
english
File:
PDF, 277 KB
english, 1992
12

Parallel detection of all palindromes in a string

Alberto Apostolico, Dany Breslauer, Zvi Galil
Journal:
Theoretical Computer Science
Year:
1995
Language:
english
File:
PDF, 786 KB
english, 1995
13

An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm

Breslauer, Dany, Galil, Zvi
Journal:
SIAM Journal on Computing
Year:
1990
Language:
english
File:
PDF, 960 KB
english, 1990
14

A Lower Bound for Parallel String Matching

Breslauer, Dany, Galil, Zvi
Journal:
SIAM Journal on Computing
Year:
1992
Language:
english
File:
PDF, 907 KB
english, 1992
16

On suffix extensions in suffix trees

Breslauer, Dany, Italiano, Giuseppe F.
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 354 KB
english, 2012
18

Appointments.

Breslauer, Dany, Italiano, Giuseppe F.
Journal:
The Lancet
Year:
1930
Language:
english
File:
PDF, 192 KB
english, 1930
20

Simple real-time constant-space string matching

Breslauer, Dany, Grossi, Roberto, Mignosi, Filippo
Journal:
Theoretical Computer Science
Year:
2013
Language:
english
File:
PDF, 316 KB
english, 2013
21

OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA

BRESLAUER, DANY, HARIHARAN, RAMESH
Journal:
Parallel Processing Letters
Year:
1996
Language:
english
File:
PDF, 493 KB
english, 1996
22

Real-Time Streaming String-Matching

Breslauer, Dany, Galil, Zvi
Journal:
ACM Transactions on Algorithms
Year:
2014
Language:
english
File:
PDF, 283 KB
english, 2014